Non-Redundant Dynamic Data Allocation in Distributed Database System

نویسندگان

  • Raju Kumar
  • Neena Gupta
  • S. Ceri
  • B. Pernici
  • W. W. Chu
  • Arjan Singh
  • C. V. Ramamoorthy
چکیده

In the past few decades, the significant developments in database and networking technologies contributed to advances in distributed database systems (DDS). The data allocation is a prominent issue in distributed database systems and is performed on data access static and dynamic patterns. This paper proposes a new strategy named Extended Threshold Algorithm (ETA) for non-redundant dynamic data allocation in distributed database. The proposed algorithm is an extension of Threshold and Time Constraint Algorithm (TTCA) which was based on Optimal and Threshold algorithms. ETA performs relocation of data fragments with respect to changing access patterns to data fragments. It also reduces the space requirement and

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Non-Redundant Dynamic Data Allocation in Distributed Database Systems

In the past few decades, the significant developments in database and networking technologies contributed to advances in distributed database systems (DDS). The data allocation is a prominent issue in distributed database systems and is performed on data access static and dynamic patterns. This paper proposes a new strategy named Extended Threshold Algorithm (ETA) for non-redundant dynamic data...

متن کامل

Non-replicated Dynamic Data Allocation in Distributed Database Systems

Allocation of data or fragments in distributed database is a critical design issue and requires the most effort. It has the greater impact on the quality of the final solution and hence the operational efficiency of the system. Performance of the distributed database system is heavily dependent on allocation of data among the different sites over the network. The static allocation provides only...

متن کامل

Dynamic Data Allocation Methods in Distributed Database System

Allocation of data or fragments in distributed database is a critical design issue and requires the most effort. It has the greater impact on the quality of the final solution and hence the operational efficiency of the system. Performance of the distributed database system is heavily dependent on allocation of data among the different sites over the network. The static allocation provides only...

متن کامل

Multi-objective Dynamic Planning of Substations and Primary Feeders Considering Uncertainties and Reliability

This research uses a comprehensive method to solve a combinatorial problem of distribution network expansion planning (DNEP) problem. The proposed multi-objective scheme aims to improve power system's accountability and system performance parameters, simultaneously, in the lowest possible costs. The dynamic programming approach is implemented in order to find the optimal sizing, siting and timi...

متن کامل

Data Allocation and Transaction Processing in Distributed Database Systems

Distributed database processing requires the transmission of data between computers in a distributed system. Data transmission is becoming an increasingly attractive data-dissemination method for large database systems. In order to effectively utilize distributed query processing, it is necessary to have efficient dynamic allocation algorithms that can balance individual and overall performance...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017